Recursive Blocked Algorithms for Solving Periodic Triangular Sylvester-Type Matrix Equations

نویسندگان

  • Robert A. Granat
  • Isak Jonsson
  • Bo Kågström
چکیده

Recently, recursive blocked algorithms for solving triangular one-sided and two-sided Sylvester-type equations were introduced by Jonsson and K̊agström. This elegant yet simple technique enables an automatic variable blocking that has the potential of matching the memory hierarchies of today’s HPC systems. The main parts of the computations are performed as level 3 general matrix multiply and add (GEMM) operations. We extend and apply the recursive blocking technique to solving periodic Sylvester-type matrix equations. Successive recursive splittings are performed on 3-dimensional arrays, where the third dimension represents the periodicity of a matrix equation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RECSY - A High Performance Library for Sylvester-Type Matrix Equations

RECSY is a library for solving triangular Sylvester-type matrix equations. Its objectives are both speed and reliability. In order to achieve these goals, RECSY is based on novel recursive blocked algorithms, which call high-performance kernels for solving small-sized leaf problems of the recursion tree. In contrast to explicit standard blocking techniques, our recursive approach leads to an au...

متن کامل

Contributions to Parallel Algorithms for Sylvester-type Matrix Equations and Periodic Eigenvalue Reordering in Cyclic Matrix Products

This Licentiate Thesis contains contributions in two different subfields of Computing Science: parallel ScaLAPACK-style algorithms for Sylvester-type matrix equations and periodic eigenvalue reordering in a cyclic product of matrices. Sylvester-type matrix equations, like the continuous-time Sylvester equation AX −XB = C, where A of size m×m, B of size n×n and C of size m×n are general matrices...

متن کامل

On the numerical solution of generalized Sylvester matrix equations

‎The global FOM and GMRES algorithms are among the effective‎ ‎methods to solve Sylvester matrix equations‎. ‎In this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two CG-type algorithms for solving generalized Sylvester matrix‎ ‎equations‎. ‎The proposed methods are iterative projection metho...

متن کامل

Combining Explicit and Recursive Blocking for Solving Triangular Sylvester-Type Matrix Equations on Distributed Memory Platforms

Parallel ScaLAPACK-style hybrid algorithms for solving the triangular continuous-time Sylvester (SYCT) equation AX − XB = C using recursive blocked node solvers from the novel high-performance library RECSY are presented. We compare our new hybrid algorithms with parallel implementations based on the SYCT solver DTRSYL from LAPACK. Experiments show that the RECSY solvers can significantly impro...

متن کامل

Combining Explicit, Recursive Blocking for Solving Triangular Sylvester-Type Matrix Equations on Distributed Memory Platforms

Parallel ScaLAPACK-style hybrid algorithms for solving the triangular continuous-time Sylvester (SYCT) equation AX − XB = C using recursive blocked node solvers from the novel high-performance library RECSY are presented. We compare our new hybrid algorithms with parallel implementations based on the SYCT solver DTRSYL from LAPACK. Experiments show that the RECSY solvers can significantly impro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006